Left Termination of the query pattern slowsort_in_2(g, a) w.r.t. the given Prolog program could successfully be proven:



↳ Prolog
  ↳ PrologToPiTRSProof

Clauses:

slowsort(X, Y) :- ','(perm(X, Y), sorted(Y)).
sorted([]).
sorted(.(X, [])).
sorted(.(X, .(Y, Z))) :- ','(le(X, Y), sorted(.(Y, Z))).
perm([], []).
perm(.(X, .(Y, [])), .(U, .(V, []))) :- ','(delete(U, .(X, Y), Z), perm(Z, V)).
delete(X, .(X, Y), Y).
delete(X, .(Y, Z), W) :- delete(X, Z, W).
le(s(X), s(Y)) :- le(X, Y).
le(0, s(X)).
le(0, 0).

Queries:

slowsort(g,a).

We use the technique of [30]. With regard to the inferred argument filtering the predicates were used in the following modes:
slowsort_in: (b,f)
perm_in: (b,f)
delete_in: (f,b,f)
sorted_in: (b)
le_in: (b,b)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

slowsort_in_ga(X, Y) → U1_ga(X, Y, perm_in_ga(X, Y))
perm_in_ga([], []) → perm_out_ga([], [])
perm_in_ga(.(X, .(Y, [])), .(U, .(V, []))) → U5_ga(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
delete_in_aga(X, .(X, Y), Y) → delete_out_aga(X, .(X, Y), Y)
delete_in_aga(X, .(Y, Z), W) → U7_aga(X, Y, Z, W, delete_in_aga(X, Z, W))
U7_aga(X, Y, Z, W, delete_out_aga(X, Z, W)) → delete_out_aga(X, .(Y, Z), W)
U5_ga(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → U6_ga(X, Y, U, V, perm_in_ga(Z, V))
U6_ga(X, Y, U, V, perm_out_ga(Z, V)) → perm_out_ga(.(X, .(Y, [])), .(U, .(V, [])))
U1_ga(X, Y, perm_out_ga(X, Y)) → U2_ga(X, Y, sorted_in_g(Y))
sorted_in_g([]) → sorted_out_g([])
sorted_in_g(.(X, [])) → sorted_out_g(.(X, []))
sorted_in_g(.(X, .(Y, Z))) → U3_g(X, Y, Z, le_in_gg(X, Y))
le_in_gg(s(X), s(Y)) → U8_gg(X, Y, le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg(0, s(X))
le_in_gg(0, 0) → le_out_gg(0, 0)
U8_gg(X, Y, le_out_gg(X, Y)) → le_out_gg(s(X), s(Y))
U3_g(X, Y, Z, le_out_gg(X, Y)) → U4_g(X, Y, Z, sorted_in_g(.(Y, Z)))
U4_g(X, Y, Z, sorted_out_g(.(Y, Z))) → sorted_out_g(.(X, .(Y, Z)))
U2_ga(X, Y, sorted_out_g(Y)) → slowsort_out_ga(X, Y)

The argument filtering Pi contains the following mapping:
slowsort_in_ga(x1, x2)  =  slowsort_in_ga(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
perm_in_ga(x1, x2)  =  perm_in_ga(x1)
[]  =  []
perm_out_ga(x1, x2)  =  perm_out_ga(x2)
.(x1, x2)  =  .(x1, x2)
U5_ga(x1, x2, x3, x4, x5)  =  U5_ga(x5)
delete_in_aga(x1, x2, x3)  =  delete_in_aga(x2)
delete_out_aga(x1, x2, x3)  =  delete_out_aga(x1, x3)
U7_aga(x1, x2, x3, x4, x5)  =  U7_aga(x5)
U6_ga(x1, x2, x3, x4, x5)  =  U6_ga(x3, x5)
U2_ga(x1, x2, x3)  =  U2_ga(x2, x3)
sorted_in_g(x1)  =  sorted_in_g(x1)
sorted_out_g(x1)  =  sorted_out_g
U3_g(x1, x2, x3, x4)  =  U3_g(x2, x3, x4)
le_in_gg(x1, x2)  =  le_in_gg(x1, x2)
s(x1)  =  s(x1)
U8_gg(x1, x2, x3)  =  U8_gg(x3)
0  =  0
le_out_gg(x1, x2)  =  le_out_gg
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
slowsort_out_ga(x1, x2)  =  slowsort_out_ga(x2)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog



↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

slowsort_in_ga(X, Y) → U1_ga(X, Y, perm_in_ga(X, Y))
perm_in_ga([], []) → perm_out_ga([], [])
perm_in_ga(.(X, .(Y, [])), .(U, .(V, []))) → U5_ga(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
delete_in_aga(X, .(X, Y), Y) → delete_out_aga(X, .(X, Y), Y)
delete_in_aga(X, .(Y, Z), W) → U7_aga(X, Y, Z, W, delete_in_aga(X, Z, W))
U7_aga(X, Y, Z, W, delete_out_aga(X, Z, W)) → delete_out_aga(X, .(Y, Z), W)
U5_ga(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → U6_ga(X, Y, U, V, perm_in_ga(Z, V))
U6_ga(X, Y, U, V, perm_out_ga(Z, V)) → perm_out_ga(.(X, .(Y, [])), .(U, .(V, [])))
U1_ga(X, Y, perm_out_ga(X, Y)) → U2_ga(X, Y, sorted_in_g(Y))
sorted_in_g([]) → sorted_out_g([])
sorted_in_g(.(X, [])) → sorted_out_g(.(X, []))
sorted_in_g(.(X, .(Y, Z))) → U3_g(X, Y, Z, le_in_gg(X, Y))
le_in_gg(s(X), s(Y)) → U8_gg(X, Y, le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg(0, s(X))
le_in_gg(0, 0) → le_out_gg(0, 0)
U8_gg(X, Y, le_out_gg(X, Y)) → le_out_gg(s(X), s(Y))
U3_g(X, Y, Z, le_out_gg(X, Y)) → U4_g(X, Y, Z, sorted_in_g(.(Y, Z)))
U4_g(X, Y, Z, sorted_out_g(.(Y, Z))) → sorted_out_g(.(X, .(Y, Z)))
U2_ga(X, Y, sorted_out_g(Y)) → slowsort_out_ga(X, Y)

The argument filtering Pi contains the following mapping:
slowsort_in_ga(x1, x2)  =  slowsort_in_ga(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
perm_in_ga(x1, x2)  =  perm_in_ga(x1)
[]  =  []
perm_out_ga(x1, x2)  =  perm_out_ga(x2)
.(x1, x2)  =  .(x1, x2)
U5_ga(x1, x2, x3, x4, x5)  =  U5_ga(x5)
delete_in_aga(x1, x2, x3)  =  delete_in_aga(x2)
delete_out_aga(x1, x2, x3)  =  delete_out_aga(x1, x3)
U7_aga(x1, x2, x3, x4, x5)  =  U7_aga(x5)
U6_ga(x1, x2, x3, x4, x5)  =  U6_ga(x3, x5)
U2_ga(x1, x2, x3)  =  U2_ga(x2, x3)
sorted_in_g(x1)  =  sorted_in_g(x1)
sorted_out_g(x1)  =  sorted_out_g
U3_g(x1, x2, x3, x4)  =  U3_g(x2, x3, x4)
le_in_gg(x1, x2)  =  le_in_gg(x1, x2)
s(x1)  =  s(x1)
U8_gg(x1, x2, x3)  =  U8_gg(x3)
0  =  0
le_out_gg(x1, x2)  =  le_out_gg
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
slowsort_out_ga(x1, x2)  =  slowsort_out_ga(x2)


Using Dependency Pairs [1,30] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

SLOWSORT_IN_GA(X, Y) → U1_GA(X, Y, perm_in_ga(X, Y))
SLOWSORT_IN_GA(X, Y) → PERM_IN_GA(X, Y)
PERM_IN_GA(.(X, .(Y, [])), .(U, .(V, []))) → U5_GA(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
PERM_IN_GA(.(X, .(Y, [])), .(U, .(V, []))) → DELETE_IN_AGA(U, .(X, Y), Z)
DELETE_IN_AGA(X, .(Y, Z), W) → U7_AGA(X, Y, Z, W, delete_in_aga(X, Z, W))
DELETE_IN_AGA(X, .(Y, Z), W) → DELETE_IN_AGA(X, Z, W)
U5_GA(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → U6_GA(X, Y, U, V, perm_in_ga(Z, V))
U5_GA(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → PERM_IN_GA(Z, V)
U1_GA(X, Y, perm_out_ga(X, Y)) → U2_GA(X, Y, sorted_in_g(Y))
U1_GA(X, Y, perm_out_ga(X, Y)) → SORTED_IN_G(Y)
SORTED_IN_G(.(X, .(Y, Z))) → U3_G(X, Y, Z, le_in_gg(X, Y))
SORTED_IN_G(.(X, .(Y, Z))) → LE_IN_GG(X, Y)
LE_IN_GG(s(X), s(Y)) → U8_GG(X, Y, le_in_gg(X, Y))
LE_IN_GG(s(X), s(Y)) → LE_IN_GG(X, Y)
U3_G(X, Y, Z, le_out_gg(X, Y)) → U4_G(X, Y, Z, sorted_in_g(.(Y, Z)))
U3_G(X, Y, Z, le_out_gg(X, Y)) → SORTED_IN_G(.(Y, Z))

The TRS R consists of the following rules:

slowsort_in_ga(X, Y) → U1_ga(X, Y, perm_in_ga(X, Y))
perm_in_ga([], []) → perm_out_ga([], [])
perm_in_ga(.(X, .(Y, [])), .(U, .(V, []))) → U5_ga(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
delete_in_aga(X, .(X, Y), Y) → delete_out_aga(X, .(X, Y), Y)
delete_in_aga(X, .(Y, Z), W) → U7_aga(X, Y, Z, W, delete_in_aga(X, Z, W))
U7_aga(X, Y, Z, W, delete_out_aga(X, Z, W)) → delete_out_aga(X, .(Y, Z), W)
U5_ga(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → U6_ga(X, Y, U, V, perm_in_ga(Z, V))
U6_ga(X, Y, U, V, perm_out_ga(Z, V)) → perm_out_ga(.(X, .(Y, [])), .(U, .(V, [])))
U1_ga(X, Y, perm_out_ga(X, Y)) → U2_ga(X, Y, sorted_in_g(Y))
sorted_in_g([]) → sorted_out_g([])
sorted_in_g(.(X, [])) → sorted_out_g(.(X, []))
sorted_in_g(.(X, .(Y, Z))) → U3_g(X, Y, Z, le_in_gg(X, Y))
le_in_gg(s(X), s(Y)) → U8_gg(X, Y, le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg(0, s(X))
le_in_gg(0, 0) → le_out_gg(0, 0)
U8_gg(X, Y, le_out_gg(X, Y)) → le_out_gg(s(X), s(Y))
U3_g(X, Y, Z, le_out_gg(X, Y)) → U4_g(X, Y, Z, sorted_in_g(.(Y, Z)))
U4_g(X, Y, Z, sorted_out_g(.(Y, Z))) → sorted_out_g(.(X, .(Y, Z)))
U2_ga(X, Y, sorted_out_g(Y)) → slowsort_out_ga(X, Y)

The argument filtering Pi contains the following mapping:
slowsort_in_ga(x1, x2)  =  slowsort_in_ga(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
perm_in_ga(x1, x2)  =  perm_in_ga(x1)
[]  =  []
perm_out_ga(x1, x2)  =  perm_out_ga(x2)
.(x1, x2)  =  .(x1, x2)
U5_ga(x1, x2, x3, x4, x5)  =  U5_ga(x5)
delete_in_aga(x1, x2, x3)  =  delete_in_aga(x2)
delete_out_aga(x1, x2, x3)  =  delete_out_aga(x1, x3)
U7_aga(x1, x2, x3, x4, x5)  =  U7_aga(x5)
U6_ga(x1, x2, x3, x4, x5)  =  U6_ga(x3, x5)
U2_ga(x1, x2, x3)  =  U2_ga(x2, x3)
sorted_in_g(x1)  =  sorted_in_g(x1)
sorted_out_g(x1)  =  sorted_out_g
U3_g(x1, x2, x3, x4)  =  U3_g(x2, x3, x4)
le_in_gg(x1, x2)  =  le_in_gg(x1, x2)
s(x1)  =  s(x1)
U8_gg(x1, x2, x3)  =  U8_gg(x3)
0  =  0
le_out_gg(x1, x2)  =  le_out_gg
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
slowsort_out_ga(x1, x2)  =  slowsort_out_ga(x2)
U5_GA(x1, x2, x3, x4, x5)  =  U5_GA(x5)
LE_IN_GG(x1, x2)  =  LE_IN_GG(x1, x2)
U6_GA(x1, x2, x3, x4, x5)  =  U6_GA(x3, x5)
U3_G(x1, x2, x3, x4)  =  U3_G(x2, x3, x4)
SORTED_IN_G(x1)  =  SORTED_IN_G(x1)
U7_AGA(x1, x2, x3, x4, x5)  =  U7_AGA(x5)
DELETE_IN_AGA(x1, x2, x3)  =  DELETE_IN_AGA(x2)
SLOWSORT_IN_GA(x1, x2)  =  SLOWSORT_IN_GA(x1)
U4_G(x1, x2, x3, x4)  =  U4_G(x4)
U1_GA(x1, x2, x3)  =  U1_GA(x3)
U2_GA(x1, x2, x3)  =  U2_GA(x2, x3)
PERM_IN_GA(x1, x2)  =  PERM_IN_GA(x1)
U8_GG(x1, x2, x3)  =  U8_GG(x3)

We have to consider all (P,R,Pi)-chains

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof

Pi DP problem:
The TRS P consists of the following rules:

SLOWSORT_IN_GA(X, Y) → U1_GA(X, Y, perm_in_ga(X, Y))
SLOWSORT_IN_GA(X, Y) → PERM_IN_GA(X, Y)
PERM_IN_GA(.(X, .(Y, [])), .(U, .(V, []))) → U5_GA(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
PERM_IN_GA(.(X, .(Y, [])), .(U, .(V, []))) → DELETE_IN_AGA(U, .(X, Y), Z)
DELETE_IN_AGA(X, .(Y, Z), W) → U7_AGA(X, Y, Z, W, delete_in_aga(X, Z, W))
DELETE_IN_AGA(X, .(Y, Z), W) → DELETE_IN_AGA(X, Z, W)
U5_GA(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → U6_GA(X, Y, U, V, perm_in_ga(Z, V))
U5_GA(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → PERM_IN_GA(Z, V)
U1_GA(X, Y, perm_out_ga(X, Y)) → U2_GA(X, Y, sorted_in_g(Y))
U1_GA(X, Y, perm_out_ga(X, Y)) → SORTED_IN_G(Y)
SORTED_IN_G(.(X, .(Y, Z))) → U3_G(X, Y, Z, le_in_gg(X, Y))
SORTED_IN_G(.(X, .(Y, Z))) → LE_IN_GG(X, Y)
LE_IN_GG(s(X), s(Y)) → U8_GG(X, Y, le_in_gg(X, Y))
LE_IN_GG(s(X), s(Y)) → LE_IN_GG(X, Y)
U3_G(X, Y, Z, le_out_gg(X, Y)) → U4_G(X, Y, Z, sorted_in_g(.(Y, Z)))
U3_G(X, Y, Z, le_out_gg(X, Y)) → SORTED_IN_G(.(Y, Z))

The TRS R consists of the following rules:

slowsort_in_ga(X, Y) → U1_ga(X, Y, perm_in_ga(X, Y))
perm_in_ga([], []) → perm_out_ga([], [])
perm_in_ga(.(X, .(Y, [])), .(U, .(V, []))) → U5_ga(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
delete_in_aga(X, .(X, Y), Y) → delete_out_aga(X, .(X, Y), Y)
delete_in_aga(X, .(Y, Z), W) → U7_aga(X, Y, Z, W, delete_in_aga(X, Z, W))
U7_aga(X, Y, Z, W, delete_out_aga(X, Z, W)) → delete_out_aga(X, .(Y, Z), W)
U5_ga(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → U6_ga(X, Y, U, V, perm_in_ga(Z, V))
U6_ga(X, Y, U, V, perm_out_ga(Z, V)) → perm_out_ga(.(X, .(Y, [])), .(U, .(V, [])))
U1_ga(X, Y, perm_out_ga(X, Y)) → U2_ga(X, Y, sorted_in_g(Y))
sorted_in_g([]) → sorted_out_g([])
sorted_in_g(.(X, [])) → sorted_out_g(.(X, []))
sorted_in_g(.(X, .(Y, Z))) → U3_g(X, Y, Z, le_in_gg(X, Y))
le_in_gg(s(X), s(Y)) → U8_gg(X, Y, le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg(0, s(X))
le_in_gg(0, 0) → le_out_gg(0, 0)
U8_gg(X, Y, le_out_gg(X, Y)) → le_out_gg(s(X), s(Y))
U3_g(X, Y, Z, le_out_gg(X, Y)) → U4_g(X, Y, Z, sorted_in_g(.(Y, Z)))
U4_g(X, Y, Z, sorted_out_g(.(Y, Z))) → sorted_out_g(.(X, .(Y, Z)))
U2_ga(X, Y, sorted_out_g(Y)) → slowsort_out_ga(X, Y)

The argument filtering Pi contains the following mapping:
slowsort_in_ga(x1, x2)  =  slowsort_in_ga(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
perm_in_ga(x1, x2)  =  perm_in_ga(x1)
[]  =  []
perm_out_ga(x1, x2)  =  perm_out_ga(x2)
.(x1, x2)  =  .(x1, x2)
U5_ga(x1, x2, x3, x4, x5)  =  U5_ga(x5)
delete_in_aga(x1, x2, x3)  =  delete_in_aga(x2)
delete_out_aga(x1, x2, x3)  =  delete_out_aga(x1, x3)
U7_aga(x1, x2, x3, x4, x5)  =  U7_aga(x5)
U6_ga(x1, x2, x3, x4, x5)  =  U6_ga(x3, x5)
U2_ga(x1, x2, x3)  =  U2_ga(x2, x3)
sorted_in_g(x1)  =  sorted_in_g(x1)
sorted_out_g(x1)  =  sorted_out_g
U3_g(x1, x2, x3, x4)  =  U3_g(x2, x3, x4)
le_in_gg(x1, x2)  =  le_in_gg(x1, x2)
s(x1)  =  s(x1)
U8_gg(x1, x2, x3)  =  U8_gg(x3)
0  =  0
le_out_gg(x1, x2)  =  le_out_gg
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
slowsort_out_ga(x1, x2)  =  slowsort_out_ga(x2)
U5_GA(x1, x2, x3, x4, x5)  =  U5_GA(x5)
LE_IN_GG(x1, x2)  =  LE_IN_GG(x1, x2)
U6_GA(x1, x2, x3, x4, x5)  =  U6_GA(x3, x5)
U3_G(x1, x2, x3, x4)  =  U3_G(x2, x3, x4)
SORTED_IN_G(x1)  =  SORTED_IN_G(x1)
U7_AGA(x1, x2, x3, x4, x5)  =  U7_AGA(x5)
DELETE_IN_AGA(x1, x2, x3)  =  DELETE_IN_AGA(x2)
SLOWSORT_IN_GA(x1, x2)  =  SLOWSORT_IN_GA(x1)
U4_G(x1, x2, x3, x4)  =  U4_G(x4)
U1_GA(x1, x2, x3)  =  U1_GA(x3)
U2_GA(x1, x2, x3)  =  U2_GA(x2, x3)
PERM_IN_GA(x1, x2)  =  PERM_IN_GA(x1)
U8_GG(x1, x2, x3)  =  U8_GG(x3)

We have to consider all (P,R,Pi)-chains
The approximation of the Dependency Graph [30] contains 4 SCCs with 10 less nodes.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
                ↳ UsableRulesProof
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

LE_IN_GG(s(X), s(Y)) → LE_IN_GG(X, Y)

The TRS R consists of the following rules:

slowsort_in_ga(X, Y) → U1_ga(X, Y, perm_in_ga(X, Y))
perm_in_ga([], []) → perm_out_ga([], [])
perm_in_ga(.(X, .(Y, [])), .(U, .(V, []))) → U5_ga(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
delete_in_aga(X, .(X, Y), Y) → delete_out_aga(X, .(X, Y), Y)
delete_in_aga(X, .(Y, Z), W) → U7_aga(X, Y, Z, W, delete_in_aga(X, Z, W))
U7_aga(X, Y, Z, W, delete_out_aga(X, Z, W)) → delete_out_aga(X, .(Y, Z), W)
U5_ga(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → U6_ga(X, Y, U, V, perm_in_ga(Z, V))
U6_ga(X, Y, U, V, perm_out_ga(Z, V)) → perm_out_ga(.(X, .(Y, [])), .(U, .(V, [])))
U1_ga(X, Y, perm_out_ga(X, Y)) → U2_ga(X, Y, sorted_in_g(Y))
sorted_in_g([]) → sorted_out_g([])
sorted_in_g(.(X, [])) → sorted_out_g(.(X, []))
sorted_in_g(.(X, .(Y, Z))) → U3_g(X, Y, Z, le_in_gg(X, Y))
le_in_gg(s(X), s(Y)) → U8_gg(X, Y, le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg(0, s(X))
le_in_gg(0, 0) → le_out_gg(0, 0)
U8_gg(X, Y, le_out_gg(X, Y)) → le_out_gg(s(X), s(Y))
U3_g(X, Y, Z, le_out_gg(X, Y)) → U4_g(X, Y, Z, sorted_in_g(.(Y, Z)))
U4_g(X, Y, Z, sorted_out_g(.(Y, Z))) → sorted_out_g(.(X, .(Y, Z)))
U2_ga(X, Y, sorted_out_g(Y)) → slowsort_out_ga(X, Y)

The argument filtering Pi contains the following mapping:
slowsort_in_ga(x1, x2)  =  slowsort_in_ga(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
perm_in_ga(x1, x2)  =  perm_in_ga(x1)
[]  =  []
perm_out_ga(x1, x2)  =  perm_out_ga(x2)
.(x1, x2)  =  .(x1, x2)
U5_ga(x1, x2, x3, x4, x5)  =  U5_ga(x5)
delete_in_aga(x1, x2, x3)  =  delete_in_aga(x2)
delete_out_aga(x1, x2, x3)  =  delete_out_aga(x1, x3)
U7_aga(x1, x2, x3, x4, x5)  =  U7_aga(x5)
U6_ga(x1, x2, x3, x4, x5)  =  U6_ga(x3, x5)
U2_ga(x1, x2, x3)  =  U2_ga(x2, x3)
sorted_in_g(x1)  =  sorted_in_g(x1)
sorted_out_g(x1)  =  sorted_out_g
U3_g(x1, x2, x3, x4)  =  U3_g(x2, x3, x4)
le_in_gg(x1, x2)  =  le_in_gg(x1, x2)
s(x1)  =  s(x1)
U8_gg(x1, x2, x3)  =  U8_gg(x3)
0  =  0
le_out_gg(x1, x2)  =  le_out_gg
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
slowsort_out_ga(x1, x2)  =  slowsort_out_ga(x2)
LE_IN_GG(x1, x2)  =  LE_IN_GG(x1, x2)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting [30] we can delete all non-usable rules from R.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

LE_IN_GG(s(X), s(Y)) → LE_IN_GG(X, Y)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
                      ↳ QDP
                        ↳ QDPSizeChangeProof
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

LE_IN_GG(s(X), s(Y)) → LE_IN_GG(X, Y)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs: 



↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
              ↳ PiDP
              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

U3_G(X, Y, Z, le_out_gg(X, Y)) → SORTED_IN_G(.(Y, Z))
SORTED_IN_G(.(X, .(Y, Z))) → U3_G(X, Y, Z, le_in_gg(X, Y))

The TRS R consists of the following rules:

slowsort_in_ga(X, Y) → U1_ga(X, Y, perm_in_ga(X, Y))
perm_in_ga([], []) → perm_out_ga([], [])
perm_in_ga(.(X, .(Y, [])), .(U, .(V, []))) → U5_ga(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
delete_in_aga(X, .(X, Y), Y) → delete_out_aga(X, .(X, Y), Y)
delete_in_aga(X, .(Y, Z), W) → U7_aga(X, Y, Z, W, delete_in_aga(X, Z, W))
U7_aga(X, Y, Z, W, delete_out_aga(X, Z, W)) → delete_out_aga(X, .(Y, Z), W)
U5_ga(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → U6_ga(X, Y, U, V, perm_in_ga(Z, V))
U6_ga(X, Y, U, V, perm_out_ga(Z, V)) → perm_out_ga(.(X, .(Y, [])), .(U, .(V, [])))
U1_ga(X, Y, perm_out_ga(X, Y)) → U2_ga(X, Y, sorted_in_g(Y))
sorted_in_g([]) → sorted_out_g([])
sorted_in_g(.(X, [])) → sorted_out_g(.(X, []))
sorted_in_g(.(X, .(Y, Z))) → U3_g(X, Y, Z, le_in_gg(X, Y))
le_in_gg(s(X), s(Y)) → U8_gg(X, Y, le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg(0, s(X))
le_in_gg(0, 0) → le_out_gg(0, 0)
U8_gg(X, Y, le_out_gg(X, Y)) → le_out_gg(s(X), s(Y))
U3_g(X, Y, Z, le_out_gg(X, Y)) → U4_g(X, Y, Z, sorted_in_g(.(Y, Z)))
U4_g(X, Y, Z, sorted_out_g(.(Y, Z))) → sorted_out_g(.(X, .(Y, Z)))
U2_ga(X, Y, sorted_out_g(Y)) → slowsort_out_ga(X, Y)

The argument filtering Pi contains the following mapping:
slowsort_in_ga(x1, x2)  =  slowsort_in_ga(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
perm_in_ga(x1, x2)  =  perm_in_ga(x1)
[]  =  []
perm_out_ga(x1, x2)  =  perm_out_ga(x2)
.(x1, x2)  =  .(x1, x2)
U5_ga(x1, x2, x3, x4, x5)  =  U5_ga(x5)
delete_in_aga(x1, x2, x3)  =  delete_in_aga(x2)
delete_out_aga(x1, x2, x3)  =  delete_out_aga(x1, x3)
U7_aga(x1, x2, x3, x4, x5)  =  U7_aga(x5)
U6_ga(x1, x2, x3, x4, x5)  =  U6_ga(x3, x5)
U2_ga(x1, x2, x3)  =  U2_ga(x2, x3)
sorted_in_g(x1)  =  sorted_in_g(x1)
sorted_out_g(x1)  =  sorted_out_g
U3_g(x1, x2, x3, x4)  =  U3_g(x2, x3, x4)
le_in_gg(x1, x2)  =  le_in_gg(x1, x2)
s(x1)  =  s(x1)
U8_gg(x1, x2, x3)  =  U8_gg(x3)
0  =  0
le_out_gg(x1, x2)  =  le_out_gg
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
slowsort_out_ga(x1, x2)  =  slowsort_out_ga(x2)
U3_G(x1, x2, x3, x4)  =  U3_G(x2, x3, x4)
SORTED_IN_G(x1)  =  SORTED_IN_G(x1)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting [30] we can delete all non-usable rules from R.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
              ↳ PiDP
              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

U3_G(X, Y, Z, le_out_gg(X, Y)) → SORTED_IN_G(.(Y, Z))
SORTED_IN_G(.(X, .(Y, Z))) → U3_G(X, Y, Z, le_in_gg(X, Y))

The TRS R consists of the following rules:

le_in_gg(s(X), s(Y)) → U8_gg(X, Y, le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg(0, s(X))
le_in_gg(0, 0) → le_out_gg(0, 0)
U8_gg(X, Y, le_out_gg(X, Y)) → le_out_gg(s(X), s(Y))

The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x1, x2)
le_in_gg(x1, x2)  =  le_in_gg(x1, x2)
s(x1)  =  s(x1)
U8_gg(x1, x2, x3)  =  U8_gg(x3)
0  =  0
le_out_gg(x1, x2)  =  le_out_gg
U3_G(x1, x2, x3, x4)  =  U3_G(x2, x3, x4)
SORTED_IN_G(x1)  =  SORTED_IN_G(x1)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
                      ↳ QDP
                        ↳ UsableRulesReductionPairsProof
              ↳ PiDP
              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

SORTED_IN_G(.(X, .(Y, Z))) → U3_G(Y, Z, le_in_gg(X, Y))
U3_G(Y, Z, le_out_gg) → SORTED_IN_G(.(Y, Z))

The TRS R consists of the following rules:

le_in_gg(s(X), s(Y)) → U8_gg(le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg
le_in_gg(0, 0) → le_out_gg
U8_gg(le_out_gg) → le_out_gg

The set Q consists of the following terms:

le_in_gg(x0, x1)
U8_gg(x0)

We have to consider all (P,Q,R)-chains.
By using the usable rules with reduction pair processor [15] with a polynomial ordering [25], all dependency pairs and the corresponding usable rules [17] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.

The following dependency pairs can be deleted:

SORTED_IN_G(.(X, .(Y, Z))) → U3_G(Y, Z, le_in_gg(X, Y))
U3_G(Y, Z, le_out_gg) → SORTED_IN_G(.(Y, Z))
The following rules are removed from R:

le_in_gg(s(X), s(Y)) → U8_gg(le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg
le_in_gg(0, 0) → le_out_gg
U8_gg(le_out_gg) → le_out_gg
Used ordering: POLO with Polynomial interpretation [25]:

POL(.(x1, x2)) = 2 + 2·x1 + 2·x2   
POL(0) = 1   
POL(SORTED_IN_G(x1)) = 1 + x1   
POL(U3_G(x1, x2, x3)) = 2·x1 + 2·x2 + 2·x3   
POL(U8_gg(x1)) = 2 + x1   
POL(le_in_gg(x1, x2)) = x1 + x2   
POL(le_out_gg) = 2   
POL(s(x1)) = 1 + 2·x1   



↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
                      ↳ QDP
                        ↳ UsableRulesReductionPairsProof
                          ↳ QDP
                            ↳ PisEmptyProof
              ↳ PiDP
              ↳ PiDP

Q DP problem:
P is empty.
R is empty.
The set Q consists of the following terms:

le_in_gg(x0, x1)
U8_gg(x0)

We have to consider all (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

DELETE_IN_AGA(X, .(Y, Z), W) → DELETE_IN_AGA(X, Z, W)

The TRS R consists of the following rules:

slowsort_in_ga(X, Y) → U1_ga(X, Y, perm_in_ga(X, Y))
perm_in_ga([], []) → perm_out_ga([], [])
perm_in_ga(.(X, .(Y, [])), .(U, .(V, []))) → U5_ga(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
delete_in_aga(X, .(X, Y), Y) → delete_out_aga(X, .(X, Y), Y)
delete_in_aga(X, .(Y, Z), W) → U7_aga(X, Y, Z, W, delete_in_aga(X, Z, W))
U7_aga(X, Y, Z, W, delete_out_aga(X, Z, W)) → delete_out_aga(X, .(Y, Z), W)
U5_ga(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → U6_ga(X, Y, U, V, perm_in_ga(Z, V))
U6_ga(X, Y, U, V, perm_out_ga(Z, V)) → perm_out_ga(.(X, .(Y, [])), .(U, .(V, [])))
U1_ga(X, Y, perm_out_ga(X, Y)) → U2_ga(X, Y, sorted_in_g(Y))
sorted_in_g([]) → sorted_out_g([])
sorted_in_g(.(X, [])) → sorted_out_g(.(X, []))
sorted_in_g(.(X, .(Y, Z))) → U3_g(X, Y, Z, le_in_gg(X, Y))
le_in_gg(s(X), s(Y)) → U8_gg(X, Y, le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg(0, s(X))
le_in_gg(0, 0) → le_out_gg(0, 0)
U8_gg(X, Y, le_out_gg(X, Y)) → le_out_gg(s(X), s(Y))
U3_g(X, Y, Z, le_out_gg(X, Y)) → U4_g(X, Y, Z, sorted_in_g(.(Y, Z)))
U4_g(X, Y, Z, sorted_out_g(.(Y, Z))) → sorted_out_g(.(X, .(Y, Z)))
U2_ga(X, Y, sorted_out_g(Y)) → slowsort_out_ga(X, Y)

The argument filtering Pi contains the following mapping:
slowsort_in_ga(x1, x2)  =  slowsort_in_ga(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
perm_in_ga(x1, x2)  =  perm_in_ga(x1)
[]  =  []
perm_out_ga(x1, x2)  =  perm_out_ga(x2)
.(x1, x2)  =  .(x1, x2)
U5_ga(x1, x2, x3, x4, x5)  =  U5_ga(x5)
delete_in_aga(x1, x2, x3)  =  delete_in_aga(x2)
delete_out_aga(x1, x2, x3)  =  delete_out_aga(x1, x3)
U7_aga(x1, x2, x3, x4, x5)  =  U7_aga(x5)
U6_ga(x1, x2, x3, x4, x5)  =  U6_ga(x3, x5)
U2_ga(x1, x2, x3)  =  U2_ga(x2, x3)
sorted_in_g(x1)  =  sorted_in_g(x1)
sorted_out_g(x1)  =  sorted_out_g
U3_g(x1, x2, x3, x4)  =  U3_g(x2, x3, x4)
le_in_gg(x1, x2)  =  le_in_gg(x1, x2)
s(x1)  =  s(x1)
U8_gg(x1, x2, x3)  =  U8_gg(x3)
0  =  0
le_out_gg(x1, x2)  =  le_out_gg
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
slowsort_out_ga(x1, x2)  =  slowsort_out_ga(x2)
DELETE_IN_AGA(x1, x2, x3)  =  DELETE_IN_AGA(x2)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting [30] we can delete all non-usable rules from R.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

DELETE_IN_AGA(X, .(Y, Z), W) → DELETE_IN_AGA(X, Z, W)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x1, x2)
DELETE_IN_AGA(x1, x2, x3)  =  DELETE_IN_AGA(x2)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
                      ↳ QDP
                        ↳ QDPSizeChangeProof
              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

DELETE_IN_AGA(.(Y, Z)) → DELETE_IN_AGA(Z)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs: 



↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof

Pi DP problem:
The TRS P consists of the following rules:

PERM_IN_GA(.(X, .(Y, [])), .(U, .(V, []))) → U5_GA(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
U5_GA(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → PERM_IN_GA(Z, V)

The TRS R consists of the following rules:

slowsort_in_ga(X, Y) → U1_ga(X, Y, perm_in_ga(X, Y))
perm_in_ga([], []) → perm_out_ga([], [])
perm_in_ga(.(X, .(Y, [])), .(U, .(V, []))) → U5_ga(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
delete_in_aga(X, .(X, Y), Y) → delete_out_aga(X, .(X, Y), Y)
delete_in_aga(X, .(Y, Z), W) → U7_aga(X, Y, Z, W, delete_in_aga(X, Z, W))
U7_aga(X, Y, Z, W, delete_out_aga(X, Z, W)) → delete_out_aga(X, .(Y, Z), W)
U5_ga(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → U6_ga(X, Y, U, V, perm_in_ga(Z, V))
U6_ga(X, Y, U, V, perm_out_ga(Z, V)) → perm_out_ga(.(X, .(Y, [])), .(U, .(V, [])))
U1_ga(X, Y, perm_out_ga(X, Y)) → U2_ga(X, Y, sorted_in_g(Y))
sorted_in_g([]) → sorted_out_g([])
sorted_in_g(.(X, [])) → sorted_out_g(.(X, []))
sorted_in_g(.(X, .(Y, Z))) → U3_g(X, Y, Z, le_in_gg(X, Y))
le_in_gg(s(X), s(Y)) → U8_gg(X, Y, le_in_gg(X, Y))
le_in_gg(0, s(X)) → le_out_gg(0, s(X))
le_in_gg(0, 0) → le_out_gg(0, 0)
U8_gg(X, Y, le_out_gg(X, Y)) → le_out_gg(s(X), s(Y))
U3_g(X, Y, Z, le_out_gg(X, Y)) → U4_g(X, Y, Z, sorted_in_g(.(Y, Z)))
U4_g(X, Y, Z, sorted_out_g(.(Y, Z))) → sorted_out_g(.(X, .(Y, Z)))
U2_ga(X, Y, sorted_out_g(Y)) → slowsort_out_ga(X, Y)

The argument filtering Pi contains the following mapping:
slowsort_in_ga(x1, x2)  =  slowsort_in_ga(x1)
U1_ga(x1, x2, x3)  =  U1_ga(x3)
perm_in_ga(x1, x2)  =  perm_in_ga(x1)
[]  =  []
perm_out_ga(x1, x2)  =  perm_out_ga(x2)
.(x1, x2)  =  .(x1, x2)
U5_ga(x1, x2, x3, x4, x5)  =  U5_ga(x5)
delete_in_aga(x1, x2, x3)  =  delete_in_aga(x2)
delete_out_aga(x1, x2, x3)  =  delete_out_aga(x1, x3)
U7_aga(x1, x2, x3, x4, x5)  =  U7_aga(x5)
U6_ga(x1, x2, x3, x4, x5)  =  U6_ga(x3, x5)
U2_ga(x1, x2, x3)  =  U2_ga(x2, x3)
sorted_in_g(x1)  =  sorted_in_g(x1)
sorted_out_g(x1)  =  sorted_out_g
U3_g(x1, x2, x3, x4)  =  U3_g(x2, x3, x4)
le_in_gg(x1, x2)  =  le_in_gg(x1, x2)
s(x1)  =  s(x1)
U8_gg(x1, x2, x3)  =  U8_gg(x3)
0  =  0
le_out_gg(x1, x2)  =  le_out_gg
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
slowsort_out_ga(x1, x2)  =  slowsort_out_ga(x2)
U5_GA(x1, x2, x3, x4, x5)  =  U5_GA(x5)
PERM_IN_GA(x1, x2)  =  PERM_IN_GA(x1)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting [30] we can delete all non-usable rules from R.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof

Pi DP problem:
The TRS P consists of the following rules:

PERM_IN_GA(.(X, .(Y, [])), .(U, .(V, []))) → U5_GA(X, Y, U, V, delete_in_aga(U, .(X, Y), Z))
U5_GA(X, Y, U, V, delete_out_aga(U, .(X, Y), Z)) → PERM_IN_GA(Z, V)

The TRS R consists of the following rules:

delete_in_aga(X, .(X, Y), Y) → delete_out_aga(X, .(X, Y), Y)
delete_in_aga(X, .(Y, Z), W) → U7_aga(X, Y, Z, W, delete_in_aga(X, Z, W))
U7_aga(X, Y, Z, W, delete_out_aga(X, Z, W)) → delete_out_aga(X, .(Y, Z), W)

The argument filtering Pi contains the following mapping:
[]  =  []
.(x1, x2)  =  .(x1, x2)
delete_in_aga(x1, x2, x3)  =  delete_in_aga(x2)
delete_out_aga(x1, x2, x3)  =  delete_out_aga(x1, x3)
U7_aga(x1, x2, x3, x4, x5)  =  U7_aga(x5)
U5_GA(x1, x2, x3, x4, x5)  =  U5_GA(x5)
PERM_IN_GA(x1, x2)  =  PERM_IN_GA(x1)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
                      ↳ QDP
                        ↳ UsableRulesReductionPairsProof

Q DP problem:
The TRS P consists of the following rules:

PERM_IN_GA(.(X, .(Y, []))) → U5_GA(delete_in_aga(.(X, Y)))
U5_GA(delete_out_aga(U, Z)) → PERM_IN_GA(Z)

The TRS R consists of the following rules:

delete_in_aga(.(X, Y)) → delete_out_aga(X, Y)
delete_in_aga(.(Y, Z)) → U7_aga(delete_in_aga(Z))
U7_aga(delete_out_aga(X, W)) → delete_out_aga(X, W)

The set Q consists of the following terms:

delete_in_aga(x0)
U7_aga(x0)

We have to consider all (P,Q,R)-chains.
By using the usable rules with reduction pair processor [15] with a polynomial ordering [25], all dependency pairs and the corresponding usable rules [17] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.

The following dependency pairs can be deleted:

PERM_IN_GA(.(X, .(Y, []))) → U5_GA(delete_in_aga(.(X, Y)))
No rules are removed from R.

Used ordering: POLO with Polynomial interpretation [25]:

POL(.(x1, x2)) = x1 + 2·x2   
POL(PERM_IN_GA(x1)) = 1 + x1   
POL(U5_GA(x1)) = 1 + x1   
POL(U7_aga(x1)) = 2·x1   
POL([]) = 0   
POL(delete_in_aga(x1)) = x1   
POL(delete_out_aga(x1, x2)) = x1 + 2·x2   



↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
              ↳ PiDP
                ↳ UsableRulesProof
                  ↳ PiDP
                    ↳ PiDPToQDPProof
                      ↳ QDP
                        ↳ UsableRulesReductionPairsProof
                          ↳ QDP
                            ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

U5_GA(delete_out_aga(U, Z)) → PERM_IN_GA(Z)

The TRS R consists of the following rules:

delete_in_aga(.(X, Y)) → delete_out_aga(X, Y)
delete_in_aga(.(Y, Z)) → U7_aga(delete_in_aga(Z))
U7_aga(delete_out_aga(X, W)) → delete_out_aga(X, W)

The set Q consists of the following terms:

delete_in_aga(x0)
U7_aga(x0)

We have to consider all (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 1 less node.